Bounded Length UCFG Equivalence
نویسنده
چکیده
A randomised polylog time algorithm is given for deciding whether or not the sets of words of a given length generated by two unam-biguous context-free grammars coincide. The algorithm is in randomised NC4 in terms of the product of the grammar size and the length.
منابع مشابه
Lengths May Break Privacy - Or How to Check for Equivalences with Length
Security protocols have been successfully analyzed using symbolic models, where messages are represented by terms and protocols by processes. Privacy properties like anonymity or untraceability are typically expressed as equivalence between processes. While some decision procedures have been proposed for automatically deciding process equivalence, all existing approaches abstract away the infor...
متن کاملTiming Attacks in Security Protocols: Symbolic Framework and Proof Techniques
We propose a framework for timing attacks, based on (a variant of) the applied-pi calculus. Since many privacy properties, as well as strong secrecy and game-based security properties, are stated as process equivalences, we focus on (time) trace equivalence. We show that actually, considering timing attacks does not add any complexity: time trace equivalence can be reduced to length trace equiv...
متن کاملC*-algebraic Characterization of Bounded Orbit Injection Equivalence for Minimal Free Cantor Systems
Bounded orbit injection equivalence is an equivalence relation defined on minimal free Cantor systems which is a candidate to generalize flip Kakutani equivalence to actions of the Abelian free groups on more than one generator. This paper characterizes bounded orbit injection equivalence in terms of a mild strengthening of Rieffel-Morita equivalence of the associated C*-crossed-product algebra...
متن کاملA linear algorithm for string reconstruction in the reverse complement equivalence model
In the reverse complement equivalence model, it is not possible to distinguish a string from its reverse complement. We show that one can still reconstruct a string of length n, up to reverse complement, using a linear number of subsequence queries of bounded length. We first give the proof for strings over a binary alphabet, and then extend it to arbitrary finite alphabets. A simple informatio...
متن کاملUniqueness for the Signature of a Path of Bounded Variation and the Reduced Path Group
Abstract. We introduce the notions of tree-like path and tree-like equivalence between paths and prove that the latter is an equivalence relation for paths of finite length. We show that the equivalence classes form a group with some similarity to a free group, and that in each class there is one special tree reduced path. The set of these paths is the Reduced Path Group. It is a continuous ana...
متن کامل